Parametric Mechanism Design via Quantifier Elimination
نویسندگان
چکیده
This paper proposes an alternative automated mechanism design approach called parametric mechanism design via quantifier elimination (PMD-QE), which utilizes QE, a symbolic formula manipulation technique. In PMD-QE, we start from a skeleton of mechanisms, which is characterized by a set of parameters, e.g., critical values. The range of parameters where the given constraints are satisfied is automatically identified by QE. To demonstrate the potential of this idea, we are able to identify a non-trivial dominant-strategy incentive compatible mechanism for a setting where a bidder has a publicly known budget limit.
منابع مشابه
Robust Nonlinear Feedback Design via Quantifier Elimination Theory
In this paper symbolic-computation methods are used to design simple, fixed-structure, robust controllers for nonlinear systems. Design specifications are reduced to logically quantified polynomial inequalities. The quantifier-elimination (QE) software package QEPCAD is used to eliminate quantifiers on state and plant parameters, to obtain regions of admissible controller parameters, and to gua...
متن کاملQuantifier Elimination in Term Algebras The Case of Finite Languages
We give a quantifier elimination procedure for term algebras over suitably expanded finite first-order languages. Our expansion is purely functional. Our method works by substituting finitely many parametric test terms. This allows us to obtain in addition sample solutions for an outermost existential quantifier block. The existence of our method implies that the considered quantifier eliminati...
متن کاملReal Solution Classification for Parametric Semi-Algebraic Systems
Real solution classification of parametric polynomial systems is a crucial problem in real quantifier elimination which interests Volker Weispfenning and others. In this paper, we present a stepwise refinement algorithm for real solution classifications of a class of parametric systems consisting of polynomial equations, inequalities and inequations. For an input system, the algorithm outputs t...
متن کاملOn the Design of Non-Fragile Compensators via Symbolic Quantifier Elimination
In this paper symbolic quantifier elimination methods are used to explore the fragility of feedback compensators, and to design feedback systems with non-fragile compensators. A compensator is said to be fragile if given variations in compensator parameters result in significant deterioration of feedback performance. The issue of fragility is important in understanding the level of acurracy req...
متن کاملBounding Quantification in Parametric Expansions of Presburger Arithmetic
Generalizing Cooper’s method of quantifier elimination for Presburger arithmetic, we give a new proof that all parametric Presburger families {St : t ∈ N} (as defined by Woods in [8]) are definable by formulas with polynomially bounded quantifiers in an expanded language with predicates for divisibility by f(t) for every polynomial f ∈ Z[t]. In fact, this quantifier bounding method works more g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015